On distributive fixed-point expressions
نویسندگان
چکیده
For every xed-point expression e of alternation-depth r, we construct a new xed-point expression e 0 of alternation-depth 2 and size O(r jej). Expression e 0 is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We show that our transformation is optimal not only w.r.t. alternation-depth but also w.r.t. the increase in size of the resulting expression.
منابع مشابه
Some common fixed point theorems for four $(psi,varphi)$-weakly contractive mappings satisfying rational expressions in ordered partial metric spaces
The aim of this paper is to prove some common fixed point theorems for four mappings satisfying $(psi,varphi)$-weak contractions involving rational expressions in ordered partial metric spaces. Our results extend, generalize and improve some well-known results in the literature. Also, we give two examples to illustrate our results.
متن کاملSome common fixed point theorems for four $(psi,varphi)$-weakly contractive mappings satisfying rational expressions in ordered partial metric spaces
The aim of this paper is to prove some common fixed point theorems for four mappings satisfying $(psi,varphi)$-weak contractions involving rational expressions in ordered partial metric spaces. Our results extend, generalize and improve some well-known results in the literature. Also, we give two examples to illustrate our results.
متن کاملThe Theory of Derivations in Almost Distributive Lattices
In this paper, we introduce the concept of a derivation in an Almost Distributive Lattice (ADL) and derive some important properties of derivations in ADLs. Also we introduce the concepts of a principal derivation, an isotone derivation and the fixed set of a derivation. We derive important results on derivations in Heyting ADLs.
متن کاملLattice structures of fixed points of the lower approximations of two types of covering-based rough sets
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough sets. In this paper, we propose two family of sets and study the conditions that these two sets become some lattice structures. These two sets are consisted by ...
متن کاملOn the failure of fixed-point theorems for chain-complete lattices in the effective topos
In the effective topos there exists a chain-complete distributive lattice with a monotone and progressive endomap which does not have a fixed point. Consequently, the Bourbaki-Witt theorem and Tarski’s fixed-point theorem for chain-complete lattices do not have constructive (topos-valid) proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 33 شماره
صفحات -
تاریخ انتشار 1999